Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
نویسندگان
چکیده
منابع مشابه
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem
We study the max-min fair allocation problem in which a set of m indivisible items are to be distributed among n agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item j on agent i is either 0 or some non-negative weight wj . For this setting, Asadpour et al. [2] showed that a certain configuration-LP can be used to estimate the o...
متن کاملMax-min fair allocation of indivisible goods
We consider the problem of fairly allocating a set of m indivisible goods to n agents, given the agents' utilities for each good. Fair allocations in this context are those maximizing the minimum utility received by any agent. We give hardness results and polynomial time approximation algorithms for several variants of this problem. Our main result is a bicriteria approximation in the model wit...
متن کاملSequential Algorithms for Max-Min Fair Bandwidth Allocation
Telecommunication networks are facing the increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises which requires to allocate bandwidth to maximize service flows with fair treatment of all the services. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. I...
متن کاملLexicographic Max-Min Optimization for Efficient and Fair Bandwidth Allocation
In many multiple criteria optimization problems preserving fairness among individual outcomes becomes an important issue. This is particularly true for systems that are designed for multiple users or services like computer or telecommunication networks. In this paper we investigate a new approach to the resource allocation preserving the, so called, Max-Min Fairness (MMF) in the solution. We an...
متن کاملAlgorithms for Max-Min Share Fair Allocation of Indivisible Chores
We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2818695